The Completeness of the Isomorphism Relation for Countable Boolean Algebras
نویسنده
چکیده
We show that the isomorphism relation for countable Boolean algebras is Borel complete, i.e., the isomorphism relation for arbitrary countable structures is Borel reducible to that for countable Boolean algebras. This implies that Ketonen’s classification of countable Boolean algebras is optimal in the sense that the kind of objects used for the complete invariants cannot be improved in an essential way. We also give a stronger form of the Vaught conjecture for Boolean algebras which states that, for any complete first-order theory of Boolean algebras that has more than one countable model up to isomorphism, the class of countable models for the theory is Borel complete. The results are applied to settle many other classification problems related to countable Boolean algebras and separable Boolean spaces. In particular, we will show that the following equivalence relations are Borel complete: the translation equivalence between closed subsets of the Cantor space, the isomorphism relation between ideals of the countable atomless Boolean algebra, the conjugacy equivalence of the autohomeomorphisms of the Cantor space, etc. Another corollary of our results is the Borel completeness of the commutative AF C∗-algebras, which in turn gives rise to similar results for Bratteli diagrams and dimension groups.
منابع مشابه
Equivalence Relations That Are Σ03 Complete for Computable Reducibility - (Extended Abstract)
Let E,F be equivalence relations on N. We say that E is computably reducible to F , written E ≤ F , if there is a computable function p : N→ N such that xEy ↔ p(x)Fp(y). We show that several natural Σ 3 equivalence relations are in fact Σ 3 complete for this reducibility. Firstly, we show that one-one equivalence of computably enumerable sets, as an equivalence relation on indices, is Σ 3 compl...
متن کاملF U N D a M E N T a Mathematicae Bounded Countable Atomic Compactness of Ordered Groups
We show that whenever A is a monotone σ-complete dimension group, then A+ ∪ {∞} is countably equationally compact, and we show how this property can supply the necessary amount of completeness in several kinds of problems. In particular, if A is a countable dimension group and E is a monotone σ-complete dimension group, then the ordered group of all relatively bounded homomorphisms from A to E ...
متن کاملIsomorphisms of Sums of Countable Boolean Algebras
Denote by nA the sum of n copies of a Boolean algebra A. We prove that, for any countable Boolean algebra A, nA at mA with m > n implies nA a (n + \)A. In [2], W. Hanf constructed a Boolean algebra H isomorphic to the direct product H X H X H but not to H X H. This result of Hanf was strengthened by J. Ketonen in [4]: there exists even a countable Boolean algebra with this property. In [1], P. ...
متن کاملNotes from Hausdorff Institute Talk Oct 10, 2013
(a) isomorphism ∼=, elementary equivalence ≡, elementary equivalence ≡α for Lω1,ω sentences of rank < α. (b) Isomorphism of countable graphs, linear orders, countable Boolean algebras is ≤B complete for orbit equivalence relations of continuous S∞ actions (≤B is Borel reducibility, S∞ is the Polish group of permutations of ω). (c) for ∼= is partially answered in computable model theory, with no...
متن کاملDownward Closure of Depth in Countable Boolean Algebras
We study the set of depths of relative algebras of countable Boolean algebras, in particular the extent to which this set may not be downward closed within the countable ordinals for a fixed countable Boolean algebra. Doing so, we exhibit a structural difference between the class of arbitrary rank countable Boolean algebras and the class of rank one countable Boolean algebras.
متن کامل